Transmission Power Control Game with SINR as Objective Function

نویسندگان

  • Eitan Altman
  • Konstantin Avrachenkov
  • Andrey Garnaev
چکیده

We consider the transmission power control problem with SINR as objective function in the two scenarii: selfish and cooperative. We show that in the selfish (non-cooperative) scenario several Nash equilibria can arise. In particular, the game can take the form of the HawkDove game, where the users can choose either conciliation or conflict fighting for shared sub-carriers. We fully characterize different types of Nash equilibria. In the cooperative scenario, we show that the parameter area where users employ pure strategies is essentially narrower than the area where users employ mixed strategies. Moreover, we identify an area where Nash equilibrium and Pareto equilibrium coincide. If one of the users has a big signal to transmit (called a stronger user) for both scenarious meanwhile his rival has small signal to transmit (weaker user) then behaviour of the stronger user drastically changes in cooperative plot compare to selfish one. Namely, in selfish one the stronger user squeezes the weaker one from the best channel meanwhile in cooperative he allows the weaker user employs the best channel and himself prefers to apply a mixed strategy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SINR Pricing in Non Cooperative Power Control Game for Wireless Ad Hoc Networks

In wireless ad hoc networks the nodes focus on achieving the maximum SINR for efficient data transmission. In order to achieve maximum SINR the nodes culminate in exhausting the battery power for successful transmissions. This in turn affects the successful transmission of the other nodes as the maximum transmission power opted by each node serves as a source of interference for the other nodes...

متن کامل

A Stackelberg-Game-Based Power Control Algorithm for Wireless Mesh Networks

and Applied Analysis 3 whereN = {1, 2, . . . , n} is the index set of the currently active nodes, P i represents the strategy set, and U i (⋅) is the utility function for user i. Each node selects a power level p i from the convex set P i such that p i ∈ P i . Let the power vector p = (p 1 , p 2 , . . . , p n ) denote the outcome of the game in terms of the selected power levels of all the user...

متن کامل

Adaptive power control algorithm in cognitive radio based on game theory

Cognitive radio (CR) has achieved increasing attention to improve the spectrum utilisation by allowing the coexistence of primary users (PUs) and cognitive users (CUs) in the same frequency band. As the spectrum of interest is licenced to primary network, power control must be carried out within the CR system so that no excessive interference is caused to PUs. In this study, the problem of powe...

متن کامل

SINR-based MAC Games for Selfish and Malicious Users

We study the selfish and malicious transmitter behavior in medium access control (MAC) layer of wireless networks with a general channel model based on the signalto-interference-plus-noise-ratio (SINR) achievable by multiple transmitters at a single receiver. We formulate the denial of service attacks in MAC operation as a non-cooperative game of selecting the individual transmission power leve...

متن کامل

Power Control for Cognitive Radio Networks under Imperfect CSI Based on Game Theory

In this paper, the problem of power control for cognitive systems is studied via game theory. The objective is to maximize the sum utility of secondary users (SUs) subject to the primary users (PUs) interference constraints, the transmission power constraints of SUs, and the signal-to-interference-plus-noise ratio (SINR) constraint of each SU. In our earlier work, the problem was formulated as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008